Optimization Method Based on Doe and Gradient Algorithm

نویسندگان

  • XINLEI HUANG
  • PENGFEI SUN
چکیده

To solve problems that exist in optimal design such as falling into local optimal solution easily and low efficiency in multi-objective optimization, a new approach based on design of experiments (DOE) and gradient optimization (GO) was proposed. The new optimization method is called DPG (DOE Plus GO) which used DOE for preliminary analysis of the function model, and took the optimal values obtained in DOE stage as the initial values of design variables in GO stage so as to reduce the effect on the result of optimization made by the designers’ decision. This paper gave two typical examples of optimization to confirm DPG global, efficient, and accurate with Isight code. Firstly, the bimodal problem was used to test DPG’s global optimization ability, then the multi-objective optimization of the machine tool spindle, which required minimum quality, maximum stiffness, and strength was conducted. The results show the DPG optimization method could not only avoid falling into local solution, but also have an obvious superiority in treating the multi-objective optimization problems.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

SIZE AND GEOMETRY OPTIMIZATION OF TRUSS STRUCTURES USING THE COMBINATION OF DNA COMPUTING ALGORITHM AND GENERALIZED CONVEX APPROXIMATION METHOD

In recent years, the optimization of truss structures has been considered due to their several applications and their simple structure and rapid analysis. DNA computing algorithm is a non-gradient-based method derived from numerical modeling of DNA-based computing performance by new computers with DNA memory known as molecular computers. DNA computing algorithm works based on collective intelli...

متن کامل

A Note on the Descent Property Theorem for the Hybrid Conjugate Gradient Algorithm CCOMB Proposed by Andrei

In [1] (Hybrid Conjugate Gradient Algorithm for Unconstrained Optimization J. Optimization. Theory Appl. 141 (2009) 249 - 264), an efficient hybrid conjugate gradient algorithm, the CCOMB algorithm is proposed for solving unconstrained optimization problems. However, the proof of Theorem 2.1 in [1] is incorrect due to an erroneous inequality which used to indicate the descent property for the s...

متن کامل

On the hybrid conjugate gradient method for solving fuzzy optimization problem

In this paper we consider a constrained optimization problem where the objectives are fuzzy functions (fuzzy-valued functions). Fuzzy constrained Optimization (FO) problem plays an important role in many fields, including mathematics, engineering, statistics and so on. In the other side, in the real situations, it is important to know how may obtain its numerical solution of a given interesting...

متن کامل

ISOGEOMETRIC TOPOLOGY OPTIMIZATION OF STRUCTURES USING LEVEL SET METHOD INCORPORATING SENSITIVITY ANALYSIS

This study focuses on the topology optimization of structures using a hybrid of level set method (LSM) incorporating sensitivity analysis and isogeometric analysis (IGA). First, the topology optimization problem is formulated using the LSM based on the shape gradient. The shape gradient easily handles boundary propagation with topological changes. In the LSM, the topological gradient method as ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013